Graceful labeling for some star related graphs
نویسندگان
چکیده
منابع مشابه
Graceful and odd graceful labeling of some graphs
In this paper, we prove that the square graph of bistar Bn,n, the splitting graph of Bn,n and the splitting graph of star K1,n are graceful graphs. We also prove that the splitting graph and the shadow graph of bistar Bn,n admit odd graceful labeling.
متن کاملSquare Graceful Labeling of Some Graphs
A p. q graph G = V,E is said to be a square graceful graph ifthere exists an injective function f: V G → 0,1,2,3,... , q such that the induced mapping fp : E G → 1,4,9,... , q 2 defined by fp uv = f u − f v is an injection. The function f is called a square graceful labeling of G. In this paper the square graceful labeling of the caterpillar S X1,X2 ,... ,Xn , the graphs Pn−1 1,2,...n ,mK1,n ∪ ...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کامل3-difference cordial labeling of some cycle related graphs
Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...
متن کاملOdd Graceful Labeling of Some New Type of Graphs
In this paper some new type of odd graceful graphs are investigated. We prove that the graph obtained by joining a cycle C8 with some star graphs S1,r keeping one vertex and three vertices gap between pair of vertices of the cycle admits odd graceful labelling. We also prove that the graph obtained by joining a cycle C12 with some star graphs S1,r keeping two, three and five vertices gap betwee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematical Forum
سال: 2014
ISSN: 1314-7536
DOI: 10.12988/imf.2014.4477